Certain class of higher-dimensional simplicial complexes and universal C∗-algebras

On Isomorphism of Simplicial Complexes and Their Related Algebras

Vertex Decomposable Simplicial Complexes Associated to Path Graphs

Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...

Universal Central Extension of Current Superalgebras

Representation as well as central extension are two of the most important concepts in the theory of Lie (super)algebras. Apart from the interest of mathematicians, the attention of physicist are also drawn to these two subjects because of the significant amount of their applications in Physics. In fact for physicists, the study of projective representations of Lie (super)algebras  are very impo...

C∗-algebras Associated Noncommutative Circle and Their K-theory

In this article we investigate the universal C∗-algebras associated to certain 1dimensional simplicial flag complexes which describe the noncommutative circle. We denote it by S 1 . We examine the K-theory of this algebra and the subalgebras S nc 1 /Ik, Ik . Where Ik, for each k, is the ideal in S 1 generated by all products of generators hs containing at least k + 1 pairwise different generato...

New methods for constructing shellable simplicial complexes

A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...